Natural language - no infinity and probably no recursion

نویسندگان

  • Erkki Luuk
  • Hendrik Luuk
چکیده

We question the need for recursion in human cognitive processing by arguing that a generally simpler and less resource demanding process – iteration – is sufficient to account for human natural language and arithmetic performance. We claim that the only motivation for recursion, the infinity in natural language and arithmetic competence, is equally approachable by iteration and recursion. Second, we submit that the infinity in natural language and arithmetic competence reduces to imagining infinite embedding or concatenation, which is completely independent from the ability to implement infinite computation, and thus, independent from both recursion and iteration. Furthermore, we show that natural language is a finite rather than infinite set.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursion, Infinity and Modeling

Hauser (et al.) [1] claim that a core property of the human language faculty is recursion and that this property “yields discrete infinity” of natural languages. On the other hand, recursion is often motivated by the observation that there are infinitely many sentences that should be generated by a finite number of rules. It should be obvious that one cannot pursue both arguments simultaneously...

متن کامل

Learning, Bottlenecks and Infinity: a working model of the evolution of syntactic communication

Human language is unique in having a learned, arbitrary mapping between meanings and signals that is compositional and recursive. This paper presents a new approach to understanding its origins and evolution. Rather than turning to natural selection for an explanation, it is argued that general properties of the transmission of learned behaviour are sufficient to explain the particular properti...

متن کامل

Calculation for Energy of (111) Surfaces of Palladium in Tight Binding Model

In this work calculation of energetics of transition metal surfaces is presented. The tight-binding model is employed in order to calculate the energetics. The tight-binding basis set is limited to d orbitals which are valid for elements at the end of transition metals series. In our analysis we concentrated on electronic effects at temperature T=0 K, this means that no entropic term will be pr...

متن کامل

Modular Parsers for Natural-Language Processing (with proofs in the appendices)

Highly-modular parsers can be constructed as directly-executable top-down backtracking processors, and combined to form more-complex parsers using operators defined in the host programming language. In functional and logic programming, this approach is implemented using parser combinators and definite clause grammars respectively. Standard implementations are inefficient for ambiguous languages...

متن کامل

Recognizing Bangla Grammar using Predictive Parser

We describe a Context Free Grammar (CFG) for Bangla language and hence we propose a Bangla parser based on the grammar. Our approach is very much general to apply in Bangla Sentences and the method is well accepted for parsing a language of a grammar. The proposed parser is a predictive parser and we construct the parse table for recognizing Bangla grammar. Using the parse table we recognize sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012